Strong Steiner Tree Approximations in Practice
نویسندگان
چکیده
منابع مشابه
Strong Steiner Tree Approximations in Practice
In this experimental study we consider Steiner tree approximations that guarantee a constant approximation of ratio less than 2. The considered greedy algorithms and approaches based on linear programming involve the incorporation of k-restricted full components for some k ≥ 3. For most of the algorithms, their strongest theoretical approximation bounds are only achieved for k →∞. However, the ...
متن کاملContraction-Based Steiner Tree Approximations in Practice
In this experimental study we consider contraction-based Steiner tree approximations. This class contains the only approximation algorithms that guarantee a constant approximation ratio below 2 and still may be applicable in practice. Despite their vivid evolution in theory, these algorithms have, to our knowledge, never been thoroughly investigated in practice before, which is particularly int...
متن کاملThe last achievements in Steiner tree approximations
The Steiner tree problem requires a shortest tree spanning a given point set S contained in a metric space (V, d). We describe a new approach to approximation solutions of this problem and analyze the time complexity of several algorithms.
متن کاملSteiner Tree 1.39-Approximation in Practice
We consider the currently strongest Steiner tree approximation algorithm that has recently been published by Goemans, Olver, Rothvoß and Zenklusen (2012). It first solves a hypergraphic LP relaxation and then applies matroid theory to obtain an integral solution. The cost of the resulting Steiner tree is at most (1.39 + ε)-times the cost of an optimal Steiner tree where ε tends to zero as some ...
متن کاملApproximations for node-weighted Steiner tree in unit disk graphs
Given a node-weighted connected graph and a subset of terminals, the problem node-weighted Steiner tree (NWST) seeks a lightest tree connecting a given set of terminals in a node-weighted graph. While NWST in general graphs are as hard as Set Cover, NWST restricted to unit-disk graphs (UDGs) admits X. Xu, H. Du, P.-J. Wan were supported in part by NSF under grant CNS-0831831. Y. Wang was suppor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Journal of Experimental Algorithmics
سال: 2019
ISSN: 1084-6654,1084-6654
DOI: 10.1145/3299903